The Information Revelation and Privacy in Online Social Networks

The client summary identical with privacy-preservation in movable community set of connections (msns) and begin a family of novel summary identical protocols. We first propose a clear Comparison-based summary identical protocol which runs between two parties, an originator and a responder. The summary identical protocol enables the originator to get hold of the comparison-based matching result about a specified attribute in their profiles, while avoid their characteristic values from disclosure. Then we propose an implicit Comparison-based Profile matching protocol which allows the originator to straight get hold of a number of messages instead of the comparison result from the responder. The messages not linked to user profile can be separated into many groups by the responder. The originator completely decides the interested group which is unidentified to the responder. Two messages in both groups are prepared by the responder, and only one message can be obtained by the initiator according to the comparison result on a single attribute. We further generalize the icpm to an implicit Predicate-based Profile matching protocol which allows complex comparison criteria spanning multiple attributes. The anonymity analysis shows all these protocols achieve the confidentiality of user profiles. In addition, the reveals the comparison result to the initiator and provides only conditional anonymity; they do not reveal the result at all and provide full secrecy. We analyze the communication overhead and the anonymity strength of the protocols. We then present an enhanced version of the called by combining the with a novel prediction-based adaptive pseudonym change strategy. The performance comparatively studied through extensive trace-based simulations. Simulation results demonstrate that they achieve significantly higher anonymity strength with slightly larger number of pseudonym.